Classifying points for sweeping solids

نویسندگان

  • Hüseyin Erdim
  • Horea T. Ilies
چکیده

Many diverse engineering problems can be modeled with solid sweeping in a conceptually simple and intuitive way, and sweeps are considered to be one of the basic representation schemes in solid modeling. However, many properties of sweeps as well as their “informational completeness” are not well understood, which is the primary reason why computational support for solid sweeping remains scarce. We propose a generic point membership classification (PMC) for sweeping solids of arbitrary complexity moving according to one parameter affine motions. The only restrictive assumption that we make in this paper is that the initial and final configurations of the moving object do not intersect during the sweep. Our PMC test is defined in terms of inverted trajectory tests against the original geometric representation of the generator object, which implies that this test can be implemented in any geometric representation that supports curve-solid intersections. Importantly, this PMC test provides complete geometric information about the set swept by 3-dimensional objects in general motions. At the same time, it establishes the foundations for developing a new generation of computational tools for sweep boundary evaluation and trimming, as well as a number of practical applications such as shape synthesis, contact analysis and path planning.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Volumes of Solids Swept Tangentially Around General Surfaces

In Part I ([2]) the authors introduced solid tangent sweeps and solid tangent clusters produced by sweeping a planar region S tangentially around cylinders. This paper extends [2] by sweeping S not only along cylinders but also around more general surfaces, cones for example. Interesting families of tangentially swept solids of equal height and equal volume are constructed by varying the cylind...

متن کامل

Approximate swept volumes of NURBS surfaces or solids

This paper presents a method of determining the approximate swept volume of Non-Uniform Rational B-Spline (NURBS) surfaces or solids. The method consists of (1) slicing the NURBS surfaces or solids by finding the intersection of plane/surface; (2) forming the sliced curves; (3) setting up the local moving coordinate system; (4) determining the characteristic (also called singular) points or cur...

متن کامل

A comparison of sampling strategies for computing general sweeps

Sweeping moving objects has become one of the basic geometric operations used in engineering design, analysis and physical simulation. Despite their relevance, computing the boundary of the set swept by a non-polyhedral moving object is largely an open problem due to well known theoretical and computational difficulties of the envelopes. We have recently introduced a generic point membership cl...

متن کامل

Numerical Boundary Conditions for the Fast Sweeping High Order WENO Methods for Solving the Eikonal Equation

High order fast sweeping methods have been developed recently in the literature to solve static Hamilton-Jacobi equations efficiently. Comparing with the first order fast sweeping methods, the high order fast sweeping methods are more accurate, but they often require additional numerical boundary treatment for several grid points near the boundary because of the wider numerical stencil. It is p...

متن کامل

Volumes of Solids Swept Tangentially Around Cylinders

In earlier work ([1]-[5]) the authors used the method of sweeping tangents to calculate area and arclength related to certain planar regions. This paper extends the method to determine volumes of solids. Specifically, take a region S in the upper half of the xy plane and allow the plane to sweep tangentially around a general cylinder with the x axis lying on the cylinder. The solid swept by S i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computer-Aided Design

دوره 40  شماره 

صفحات  -

تاریخ انتشار 2008